On Generalised Abundance, II
نویسندگان
چکیده
منابع مشابه
Generalised Hilbert Numerators Ii
Let K[〈X〉] denote the large polynomial ring (in the sense of Halter-Koch [7]) on the set X = {x1, x2, x3, . . . } of indeterminates. For each integer n, there is a truncation homomorphism ρn : K[〈X〉] → K[x1, . . . , xn]. If I is a homogeneous ideal of K[〈X〉], then the N-graded Hilbert series of K[x1,...,xn] ρn(I) can be written as gn(t) (1−t) ; it was shown in [13] that if in addition I is what...
متن کاملGeneralised Bent Criteria for Boolean Functions (II)
In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}, {H,N} and {I,H, N} were presented, and the relevance of Local Complementation to the quadratic case was indicated. In this second part, the results are applied to develop recursive formulae for the numbers of flat spectra of some structural quadratics. Obse...
متن کاملRevisited abundance diagnostics in quasars : Fe II / Mg II ratios
Both the Fe II UV emission in the 2000−3000 Å region (Fe II(UV)) and resonance emission line complex of Mg II at 2800 Å are prominent features in quasar spectra. The observed Fe II(UV)/Mg II emission ratios have been proposed as means to measure the buildup of the Fe abundance relative to that of the α-elements C, N, O, Ne and Mg as a function of redshift. The current observed ratios show large...
متن کاملOn Generalised Kneser Colourings
There are two possible definitions of the “s-disjoint r-uniform Kneser hypergraph” of a set system T : The hyperedges are either r-sets or r-multisets. We point out that Ziegler’s (combinatorial) lower bound on the chromatic number of an s-disjoint r-uniform Kneser hypergraph only holds if we consider r-multisets as hyperedges. We give a new proof of his result and show by example that a simila...
متن کاملBreeding amicable numbers in abundance. II
In a first article of this title, new procedures were described to compute many amicable numbers by “breeding” them in several generations. An extensive computer search was later performed (in 1988), and demonstrated the remarkable effectiveness of this breeding method: the number of known amicable pairs was easily quadrupled by this search. As we learnt recently (1999) from the internet, Peder...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Peking Mathematical Journal
سال: 2019
ISSN: 2096-6075,2524-7182
DOI: 10.1007/s42543-019-00022-1